Active constrained fuzzy clustering: A multiple kernels learning approach
نویسندگان
چکیده
In this paper, we address the problem of constrained clustering along with active selection of clustering constraints in a unified framework. To this aim, we extend the improved possibilistic c-Means algorithm (IPCM) with a multiple kernels learning setting under supervision of side information. By incorporating multiple kernels, the limitation of improved possibilistic c-means to spherical clusters is addressed by mapping non-linear separable data to appropriate feature space. The proposed method is immune to inefficient kernels or irrelevant features by automatically adjusting the weight of kernels. Moreover, extending IPCM to incorporate constraints, its strong robustness and fast convergence properties are inherited by the proposed method. In order to avoid querying inefficient or redundant clustering constraints, an active query selection heuristic is embedded into the proposed method to query the most informative constraints. Experiments conducted on synthetic and real-world datasets demonstrate the effectiveness of the proposed method.
منابع مشابه
یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیکهای یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملActive semi-supervised fuzzy clustering
Clustering algorithms are increasingly employed for the categorization of image databases, in order to provide users with database overviews and make their access more effective. By including information provided by the user, the categorization process can produce results that come closer to user’s expectations. To make such a semi-supervised categorization approach acceptable for the user, thi...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملAn axiomatic approach to soft learning vector quantization and clustering
This paper presents an axiomatic approach to soft learning vector quantization (LVQ) and clustering based on reformulation. The reformulation of the fuzzy c-means (FCM) algorithm provides the basis for reformulating entropy-constrained fuzzy clustering (ECFC) algorithms. This analysis indicates that minimization of admissible reformulation functions using gradient descent leads to a broad varie...
متن کاملA Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm
Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 48 شماره
صفحات -
تاریخ انتشار 2015